Marching ridges
نویسندگان
چکیده
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measurement functions. Marching Ridges is both specific in its application to 2D and 3D medical images for the purpose of finding cores, and general in its theoretical application to finding ridges of intensity, boundary and medial measurements whose domains may include up to 8 dimensions. Marching Ridges uses derivative calculations, zero-crossing interpolations and topological heuristics to track a linear approximation of a ridge through a network of hypercubes.
منابع مشابه
Marching Optimal-Parameter Ridges: An Algorithm to Extract Shape Loci in 3D Images
This paper presents a method for identifying image loci that can be used as a basis for object segmentation and image registration. The focus is on 1D and 2D shape loci in 3D images. This method, called marching ridges, uses generalized height ridges, oriented medialness measures and a marching cubes like algorithm to extract optimal scale-orientation cores. This algorithm can can also be used ...
متن کاملConsistent Mesh Generation for Non-binary Medical Datasets
This paper presents a new approach for constructing a consistent (non-manifold) mesh based on non-binary datasets. Mesh generation is the method of choice if a surface is extracted based on labeled volumetric datasets. In most cases, the traditional Marching Cubes algorithm or one of its extensions is applied for generating meshes of binary labeled input data. However, for different – especiall...
متن کاملConstruction of Implicit Surfaces from Point Clouds Using a Feature-based Approach
We present a novel feature-based approach to surface generation from point clouds in three-dimensional space obtained by terrestrial and airborne laser scanning. In a first step, we apply a multiscale clustering and classification of local point set neighborhoods by considering their geometric shape. Corresponding feature values quantify the similarity to curve-like, surface-like, and solid-lik...
متن کاملSurfCut: Surfaces of Minimal Paths From Topological Structures
We present SurfCut, an algorithm for extracting a smooth, simple surface with an unknown 3D curve boundary from a noisy 3D image and a seed point. Our method is built on the novel observation that certain ridge curves of a function defined on a front propagated using the Fast Marching algorithm lie on the surface. Our method extracts and cuts these ridges to form the surface boundary. Our surfa...
متن کاملRidge based curve and surface reconstruction
This paper presents a new method for reconstructing curves and surfaces from unstructured point clouds, allowing for noise in the data as well as inhomogeneous distribution of the point set. It is based on the observation that the curve/surface is located where locally the point cloud has highest density. This idea is pursued by a differential geometric analysis of a smoothed version of the den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001